Twin minus total domination numbers in directed graphs
نویسندگان
چکیده
منابع مشابه
Twin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملtwin minus domination in directed graphs
let $d=(v,a)$ be a finite simple directed graph. a function$f:vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (tmdf) if $f(n^-[v])ge 1$ and $f(n^+[v])ge 1$ for eachvertex $vin v$. the twin minus domination number of $d$ is$gamma_{-}^*(d)=min{w(f)mid f mbox{ is a tmdf of } d}$. inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملThe minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملthe minus k-domination numbers in graphs
for any integer $kge 1$, a minus $k$-dominating function is a function $f : v (g)rightarrow {-1,0, 1}$ satisfying $sum_{winn[v]} f(w)ge k$ for every $vin v(g)$, where $n(v) ={u inv(g)mid uvin e(g)}$ and $n[v] =n(v)cup {v}$. the minimum ofthe values of $sum_{vin v(g)}f(v)$, taken over all minus$k$-dominating functions $f$, is called the minus $k$-dominationnumber and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2017
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1983